On two-dimensional pattern matching by optimal parallel algorithms
نویسندگان
چکیده
منابع مشابه
Optimal pattern matching algorithms
We study a class of finite state machines, called w-matching machines, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern w. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern w. Defining the orde...
متن کاملEfficient Two-Dimensional Parallel Pattern Matching with Scaling
Given a text and a pattern, the problem of pattern matching consists of determining all the positions of the text where the pattern occurs. When the text and the pattern are matrices, the matching is termed bidimensional. There are variations of this problem where we allow the matching using a somehow modified pattern. In this paper we assume that the pattern can be scaled. We propose a new par...
متن کاملParallel Implementation of Exact Two Dimensional Pattern Matching Algorithms using MPI and OpenMP
The need for processing power is constantly increasing as more processing-demanding and time-critical applications appear. Parallel processing has emerged as an efficient and costeffective solution, since low-end workstations and multiprocessors are cheaply available in the commodity market. In this paper, experimental results are presented on the parallel processing of the Naive, Karp and Rabi...
متن کاملOn Two-Dimensional Pattern Matching by Finite Automata
This paper presents a general concept of two-dimensional pattern matching using conventional (one-dimensional) finite automata. Then two particular models and methods, implementations of the general principle, are presented. The first of these two models presents an automata based version of the Bird and Baker approach with lower space complexity than the original algorithm. The second introduc...
متن کاملFast Two-Dimensional Pattern Matching
An algorithm for searching for a two dimensional m m pattern in a two dimensional n n text is presented. It performs on the average less comparisons than the size of the text: n 2 =m using m 2 extra space. Basically, it uses multiple string matching on only n=m rows of the text. It runs in at most 2n 2 time and is close to the optimal n 2 time for many patterns. It steadily extends to an alphab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00012-3